A Novel Generalized Metaheuristic Framework for Dynamic Capacitated Arc Routing Problems

The capacitated arc routing problem (CARP) is a challenging combinatorial optimization abstracted from many real-world applications, such as waste collection, road gritting, and mail delivery. However, few studies considered dynamic changes during the vehicles’ service, which can cause original schedule infeasible or obsolete. existing are limited by scenarios considered, overly complicated algorithms that unable to benefit wealth of contributions provided CARP literature. In this article, we first provide mathematical formulation (DCARP) design simulation system able consider events while solution already partially executed. We then propose novel framework static so they could be used handle DCARP instances. very flexible. response event, it use either simple restart strategy sequence transfer benefits past experience. Empirical have been conducted on wide range instances evaluate our proposed framework. results show significantly improves over state-of-the-art algorithms.